Large production line optimisation using simulated annealing

We present a robust generalised queuing network algorithm as an evaluative procedure for optimising production line configurations using simulated annealing. We compare the results obtained with our algorithm to those of other studies and find some interesting similarities but also striking differences between them in the allocation of buffers, numbers of servers, and their service rates. While context dependent, these patterns of allocation are one of the most important insights which emerge in solving very long production lines. The patterns, however, are often counter-intuitive, which underscores the difficulty of the problem we address. The most interesting feature of our optimisation procedure is its bounded execution time, which makes it viable for optimising very long production line configurations. Based on the bounded execution time property, we have optimised configurations of up to 60 stations with 120 buffers and servers in less than five hours of CPU time.